On the Parallel Complexity of Acyclic Logic Programs
نویسندگان
چکیده
In this paper we investigate the parallel complexity of computing the stable model of acyclic general logic programs Within this class of logic programs we consider the cases of negative and de nite logic programs Both cases are proved to be P complete We prove the same for a related problem namely that of computing the kernel of a directed acyclic graph
منابع مشابه
Probabilistic Graphical Models Specified by Probabilistic Logic Programs: Semantics and Complexity
We look at probabilistic logic programs as a specification language for probabilistic models, and study their interpretation and complexity. Acyclic programs specify Bayesian networks, and, depending on constraints on logical atoms, their inferential complexity reaches complexity classes #P, #NP, and even #EXP. We also investigate (cyclic) stratified probabilistic logic programs, showing that t...
متن کاملOn Acyclic and Head-Cycle Free Nested Logic Programs
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive logic programs. We then extend several results known for acyclic and head-cycle free disjunctive programs under the stable-model semantics to the nested case. Most notably, we provide a propositional semantics for the p...
متن کاملThe Complexity of Inferences and Explanations in Probabilistic Logic Programming
A popular family of probabilistic logic programming languages combines logic programs with independent probabilistic facts. We study the complexity of marginal inference, most probable explanations, and maximum a posteriori calculations for propositional/relational probabilistic logic programs that are acyclic/definite/stratified/normal/ disjunctive. We show that complexity classes Σk and PP Σk...
متن کاملOn the Semantics and Complexity of Probabilistic Logic Programs
We examine the meaning and the complexity of probabilistic logic programs that consist of a set of rules and a set of independent probabilistic facts (that is, programs based on Sato’s distribution semantics). We focus on two semantics, respectively based on stable and on well-founded models. We show that the semantics based on stable models (referred to as the “credal semantics”) produces sets...
متن کاملNegation as Failure in the Head
The class of logic programs with negation as failure in the head is a subset of the logic of MBNF introduced by Lifschitz and is an extension of the class of extended disjunctive programs. An interesting feature of such programs is that the minimality of answer sets does not hold. This paper considers the class of general extended disjunctive programs (GEDPs) as logic programs with negation as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Parallel Processing Letters
دوره 6 شماره
صفحات -
تاریخ انتشار 1996